Free arrangements of hyperplanes and supersolvable lattices
نویسندگان
چکیده
منابع مشابه
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes
Comparing two expressions of the Tutte polynomial of an ordered oriented matroid yields a remarkable numerical relation between the numbers of reorientations and bases with given activities. A natural activity preserving reorientation-to-basis mapping compatible with this relation is described in a series of papers by the present authors. This mapping, equivalent to a bijection between regions ...
متن کاملGallery Posets of Supersolvable Arrangements
We introduce a poset structure on the reduced galleries in a supersolvable arrangement of hyperplanes. In particular, for Coxeter groups of type A or B, we construct a poset of reduced words for the longest element whose Hasse diagram is the graph of reduced words. Using Rambau’s Suspension Lemma, we show that these posets are homotopy equivalent to spheres. We furthermore conjecture that its i...
متن کاملSupersolvable Frame-matroid and Graphic-lift Lattices
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...
متن کاملA Generalization of Semimodular Supersolvable Lattices
Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular latt...
متن کاملSupersolvable LL-lattices of binary trees
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1984
ISSN: 0001-8708
DOI: 10.1016/0001-8708(84)90024-0